An example in NQTHM: Ramsey's Theorem
نویسنده
چکیده
We present here a proof of Ramsey's Theorem for exponent 2 using the Boyer-Moore theorem prover. The presentation is intended to be in a style to assist those who want to learn how to improve their eeectiveness in using the Boyer-Moore logic and theorem prover.
منابع مشابه
The Paradox of the Case Study
In order to demonstrate the scalability of automated reasoning techniques, it is important to embark on large-scale case studies. As a field, we need to present a reward system for the completion of such case studies. However, there is a paradox at the heart of the case study. It is this paradox, and its resolution, that I intend to explore in this note. The classic example of the theorem provi...
متن کاملComposing and Controlling Search in Reasoning Theories Using Mappings
Reasoning theories can be used to specify heterogeneous reasoning systems. In this paper we present an equational version of reasoning theories, and we study their structuring and composition, and the use of annotated assertions for the control of search, as mappings between reasoning theories. We define composability and composition using the notion of faithful inclusion mapping, we define ann...
متن کاملIstituto per La Ricerca Scientifica E Tecnologica
Reasoning theories can be used to specify heterogeneous reasoning systems. In this paper we present an equational version of reasoning theories, and we study their structuring and composition, and the use of annotated assertions for the control of search, as mappings between reasoning theories. We define composability and composition using the notion of faithful inclusion mapping, we define ann...
متن کاملGeneric Theories as Proof Strategies: A Case Study for Weakest Precondition Style Proofs
This paper presents several techniques, motivated by the study of weakest preconditions, for structuring proofs about recursive functions using generic theories. The theories can be implemented on a variety of theorem provers that support introduction and instantiation of partial functions (PVS, HOL, ACL2, NQTHM). The focus here is on the Boyer-Moore (NQTHM [1,2]) and Kaufmann-Moore (ACL2 [6]) ...
متن کاملA Machine-Checked Proof of the Optimality of a Real-Time Scheduling Policy
We describe a mechanically-checked proof of the optimality of earliest-deadline-rst (EDF) schedulers on periodic tasks accomplished using the Nqthm theorem prover. We present a formalization of the theorem and discuss why the machine-checked proof is both more complex and more reliable than a corresponding informal proof.
متن کامل